Stochastic Simulation of Markov Modulated Finite-Source Queues
نویسندگان
چکیده
The simulation tool lcpSim can be used to investigate special level crossing problems of queueing systems of type HY POk/HY POr/1//n embedded in different Markovian environments. Our observed system consists of n heterogeneous machines (requests) and a server that ”repairs” the broken machines according to the most commonly used service disciplines. We specify a maximum number of stopped machines for an operating system and our aim is to give the main steady-state performance measures of the system, such as server utilization, machine utilization, mean waiting times, mean response times, the probability of an operating system and the mean operating time of the system. These values can be calculated by lcpSim (level crossing problem Simulation) for several types of operating and service times of the machines and for different random environments. The simulation uses the Law–Carson algorithm to provide confidence intervals for the main performance measures of the investigated system. We developed the Java language version of the lcpSim program last year. Besides the main application this version also contains an input generator (inputGen), both with user-friendly graphical interfaces. The effects of each service discipline on the performance measures of the given systems can easily be observed on the diagrams generated from the output files of the lcpSim program in terms of the increasing number of machines.
منابع مشابه
Longest Path in Networks of Queues in the Steady-State
Due to the importance of longest path analysis in networks of queues, we develop an analytical method for computing the steady-state distribution function of longest path in acyclic networks of queues. We assume the network consists of a number of queuing systems and each one has either one or infinite servers. The distribution function of service time is assumed to be exponential or Erlang. Fu...
متن کاملE ective Bandwidth and Fast Simulation of ATMIntree Networks
We consider the eecient estimation, via simulation, of very low buuer overrow probabilities in certain acyclic ATM queueing networks. We apply the theory of eeective bandwidths and Markov additive processes to derive an asymptotically optimal simulation scheme for estimating such probabilities for a single queue with multiple independent sources, each of which may be either a Markov modulated p...
متن کاملStochastic bounds for a single server queue with general retrial times
We propose to use a mathematical method based on stochastic comparisons of Markov chains in order to derive performance indice bounds. The main goal of this paper is to investigate various monotonicity properties of a single server retrial queue with first-come-first-served (FCFS) orbit and general retrial times using the stochastic ordering techniques.
متن کاملStochastic Finite Fault Modeling for the 16 September 1978 Tabas, Iran, Earthquake
The main objective of this study is estimating acceleration time history of 16 September 1978 Tabas earthquake incorporating the seismological/geological source-path and site model parameters by using finite-fault simulation approach. The method generalizes the stochastic ground-motion simulation technique, developed for point sources, to the case of finite faults. It subdivides the fault plane...
متن کاملبهدست آوردن میانگین زمان تکمیلپروژه در شبکههای پرتپویا (سیستم چندپروژهای) با ظرفیت محدود
In this paper, dynamic PERT networks with finite capacity of concurrent projects are expressed in the framework of networks of queues. In this investigation, it is assumed that the system capacity is finite and new projects are generated according to a Poisson process. There is only one server in every service station and the discipline of queue is FCFS (Fist Come, First Served). Each activity ...
متن کاملBounds on the Tail Distributions of Markov-modulated Stochastic Max-plus Systems
In this paper we consider a particular class of linear systems under the max-plus algebra and derive exponential upper bounds for the tail distribution of each component of the state vector in the case of Markov modulated input sequences. Our results are then applied to tandem queues with innnite buuers, Markov modulated arrivals and deterministic service times.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- Universität Trier, Mathematik/Informatik, Forschungsbericht
دوره 99-06 شماره
صفحات -
تاریخ انتشار 1999